منابع مشابه
Finitely Bounded Effective Computability
One of the most important property of the computability is the certainty. For example a set of natural numbers is computable if there is a Turing machine which decides certainly if a given natural number belongs to the set or not, and no wrong answers are tolerant. On the other hand, the finitely bounded computability discussed in this paper allows finitely many mistakes which can be eventually...
متن کاملCTL with Finitely Bounded Semantics
We consider a variation of the branching time logic CTL with non-standard, “finitely bounded” semantics (FBS). FBS is naturally defined as game-theoretic semantics where the proponent of truth of an eventuality must commit to a time limit (number of transition steps) within which the formula should become true on all (resp. some) paths starting from the state where the formula is evaluated. The...
متن کاملAn Effective Characterization of Computability in Anonymous Networks
We provide effective (i.e., recursive) characterizations of the relations that can be computed on networks where all processors use the same algorithm, start from the same state, and know at least a bound on the network size. Three activation models are considered (synchronous, asynchronous, interleaved).
متن کاملL1-Computability, Layerwise Computability and Solovay Reducibility
We propose a hierarchy of classes of functions that corresponds to the hierarchy of randomness notions. Each class of functions converges at the corresponding random points. We give various characterizations of the classes, that is, characterizations via integral tests, L-computability and layerwise computability. Furthermore, the relation among these classes is formulated using a version of So...
متن کاملComputability versus exact computability of martingales
This note gives a simple example of a polynomial time computable martingale that has rational values but is not exactly computable.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2008
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2008.03.019